GATE PYQ

ISRO CSE 2015

Q21.
The following program main() { inc(); inc(); inc(); } inc() { static int x; printf("%d", ++x); }

Q22.
A hash table with ten buckets with one slot per bucket is shown in the following figure. The symbols S1 to S7 initially entered using a hashing function with linear probing. The maximum number of comparisons needed in searching an item that is not present is

Q23.
Minimum number of 2x1 multiplexers required to realize the following function, f=\bar{A} \bar{B} C+\bar{A} \bar{B} \bar{C}Assume that inputs are available only in true form and Boolean a constant 1 and 0 are available.

Q24.
If half adders and full adders are implements using gates, then for the addition of two 17 bit numbers (using minimum gates) the number of half adders and full adders required will be

Q25.
Yacc stands for

Q26.
The number of tokens in the following C statement is printf("i=%d, &i=%x", i, &i);

Q27.
How many 32K x 1 RAM chips are needed to provide a memory capacity of 256K-bytes?

Q28.
Dirty bit for a page in a page table

Q29.
Increasing the RAM of a computer typically improves performance because:

Q30.
If there are 32 segments, each size 1k bytes, then the logical address should have